An Algorithm to Verify Formulas by means of (0,S,=)-BDDs
نویسندگان
چکیده
In this article we provide an algorithm to verify formulas of the fragment of first order logic, consisting of quantifier free logic with zero, successor and equality. We first develop a rewrite system to extract an equivalent Ordered (0, S,=)-BDD from any given (0, S,=)-BDD. Then we show completeness of the rewrite system. Finally we make an algorithm with the same result as the rewrite system. Given an Ordered (0, S,=)-BDDs we are able to see in constant time whether the formula is a tautology, a contradiction, or only satisfiable.
منابع مشابه
A Term Rewriting Technique for Decision Graphs
We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to generate an equivalent Ordered (0, S,=)-BDD from any given (0, S,=)-BDD. Having the ordered representation of the BDDs, one can verify the original formula in cons...
متن کاملPropositionalizing the EM algorithm by BDDs
We propose an Expectation-Maximization (EM) algorithm which works on binary decision diagrams (BDDs). The proposed algorithm, BDD-EM algorithm, opens a way to apply BDDs to statistical learning. The BDD-EM algorithm makes it possible to learn probabilities in statistical models described by Boolean formulas, and the time complexity is proportional to the size of BDDs representing them. We apply...
متن کاملA PARTICLE SWARM OPTIMIZATION ALGORITHM TO SUGGEST FORMULAS FOR THE BEHAVIOUR OF THE RECYCLED MATERIAL REINFORCED CONCRETE BEAMS
Reducing waste material plays an essential role for engineers in the current world. Nowadays, recycled materials are going to be used in order to manufacture concrete beams. Previous studies concluded that the currently proposed formulas to predict the flexural and shear behavior of the reinforced concrete beams were not appropriate for those manufactured by recycled materials. This study aims ...
متن کاملBinary decision diagrams for first-order predicate logic
Binary decision diagrams (BDDs) are known to be a very efficient technique to handle propositional formulas. We present an extension of BDDs such that they can be used for predicate logic. We define BDDs similar to Bryant [IEEE Trans. Comp. C-35 (1986) 677–691], but with the difference that we allow predicates as labels instead of proposition symbols. We present a sound and complete proof searc...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کامل